The multicommodity assignment problem: a network aggregation heuristic
نویسندگان
چکیده
منابع مشابه
A capacity scaling heuristic for the multicommodity capacitated network design problem
In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generat...
متن کاملMulticommodity Capacitated Network Design Problem
We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA two Stage Heuristic Solution Approach for Resource Assignment during a Cell Formation Problem
Design of Cellular Manufacturing System involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA). These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. In this paper a two stage heuristic procedure is proposed for CF and RA decisions problem. The solution approach contains a ...
متن کاملModel for Network Assignment Problem of Capacitated Freight with Disruptions Integer Multicommodity Flow with Recourse
mends the use of travel time values for congested periods that are 2.5 times the value of time estimates during uncongested periods (7). Kawamura investigated differences in value of time among operators and trucking industry segments; findings from Kawamura’s research show that freight carriers have a value of time that is several times higher than that of passenger vehicles and that there is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1981
ISSN: 0898-1221
DOI: 10.1016/0898-1221(81)90118-8